Finitely Based Modular Congruence Varieties Are Distributive

نویسندگان

  • Ralph Freese
  • Mark Haiman
چکیده

R. Dedekind introduced the modular law, a lattice equation true in most of the lattices associated with classical algebraic systems, see [4]. Although this law is one of the most important tools for working with these lattices, it does not fully describe the equational properties of these lattices. This was made clear in [8] where B. Jónsson and the author showed that if any modular congruence variety actually satisfies the (stronger) Arguesian law. (A congruence variety is the variety generated by all the congruence lattices of the members of a variety of algebras.) In this note we show that no finite set of lattice equations is strong enough to describe the equational properties of the lattices associated with classical algebraic systems in the following strong sense: there is no modular, nondistributive congruence variety which has a finite basis for its equational theory. This question was posed by George McNulty in the problem session on lattice theory at the Jónsson symposium. Jónsson had asked a similar question in [17]. He asked, in Problem 9.12, whether there is a nontrivial variety whose congruence variety is neither the variety of all lattices nor the variety of all distributive lattices, but which is finitely based. Some partial results on this problem had been obtained previously. Let Vn denote the class of lattices embeddable into the lattice of subgroups of an abelian group of exponent n and let V0 be those lattices embeddable into the lattice of subspaces of a rational vector space. Thus HVn is the congruence variety associated with the variety of abelian groups of exponent n. In [7] it was shown that if L is a class of lattices contained in a modular congruence variety and containing Vn for some n not a prime, then L cannot be defined by finitely many first order axioms. It was also shown that every modular, nondistributive congruence variety contains HVn for some n. Mark Haiman, in his proof that there are Arguesian lattices which are not representable as lattices of permuting equivalence relations (solving an old problem of Jónsson), shows that HVp is not finitely based for any prime p, [11] and [12].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Finite Basis Theorem for Difference-term Varieties with a Finite Residual Bound

We prove that if V is a variety of algebras (i.e., an equationally axiomatizable class of algebraic structures) in a finite language, V has a difference term, and V has a finite residual bound, then V is finitely axiomatizable. This provides a common generalization of R. McKenzie’s finite basis theorem for congruence modular varieties with a finite residual bound, and R. Willard’s finite basis ...

متن کامل

Principal and Syntactic Congruences in Congruence-distributive and Congruence-permutable Varieties

We give a new proof that a finitely generated congruence-distributive variety has finitely determined syntactic congruences (or equivalently, term finite principal congruences), and show that the same does not hold for finitely generated congruence-permutable varieties, even under the additional assumption that the variety is residually very finite. 2000 Mathematics subject classification: 08B10.

متن کامل

Finitely Related Algebras in Congruence Distributive Varieties Have Near Unanimity Terms

We show that every finite, finitely related algebra in a congruence distributive variety has a near unanimity term operation. As a consequence we solve the near unanimity problem for relational structures: it is decidable whether a given finite set of relations on a finite set admits a compatible near unanimity operation. This consequence also implies that it is decidable whether a given finite...

متن کامل

Relation Formulas for Protoalgebraic Equality Free Quasivarieties; Pałasińska's Theorem Revisited

We provide a new proof of the following Pa lasińska’s theorem: Every finitely generated protoalgebraic relation distributive equality free quasivariety is finitely axiomatizable. The main tool we use are Q-relation formulas, for a protoalgebraic equality free quasivariety Q, which are the counterparts of the congruence formulas used for describing the generation of congruences in algebras. Havi...

متن کامل

Finite Axiomatizability of Congruence Rich Varieties

In this paper we introduce the notion of a congruence rich variety of algebras, and investigate which locally finite subvarieties of such a variety are relatively finitely based. We apply the results obtained to investigate the finite axiomatizability of an interesting variety generated by a particular five-element directoid. Roughly speaking, congruence rich varieties are those in which all la...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994